COMPUTATION USING A SIMPLIFIED THEORY OF MULTIPLE LEAKY AQUIFERS

Secure Computation Using Leaky Tokens

Leakage-proof hardware tokens have been used to achieve a large number of cryptographic tasks recently. But in real life, due to various physical attacks, it is extremely difficult to construct hardware devices that are guaranteed to be leakage-proof. In this paper, we study the feasibility of general two-party computation using leaky hardware tokens. Our main result is a completeness theorem t...

On Simplified Modelling of the Leaky Bucket

The Generic Cell Rate Algorithm, or more commonly the leaky bucket, has been standardised as the algorithm that will be implemented in Asynchronous Transfer Mode ( ATM ) networks. To model an ATM network it is important to be able to model this algorithm. However most proposed models are complex and because the leaky bucket is only one element within the network the model should be simple. In t...

Secure Computation using Leaky Correlations (Asymptotically Optimal Constructions)

Most secure computation protocols can be e ortlessly adapted to o oad a signi cant fraction of their computationally and cryptographically expensive components to an o ine phase so that the parties can run a fast online phase and perform their intended computation securely. During this o ine phase, parties generate private shares of a sample generated from a particular joint distribution, refer...

A new method for the interpretation of pumping tests in leaky aquifers.

A novel methodology for the interpretation of pumping tests in leaky aquifer systems, referred to as the double inflection point (DIP) method, is presented. The method is based on the analysis of the first and second derivatives of the drawdown with respect to log time for the estimation of the flow parameters. Like commonly used analysis procedures, such as the type-curve approach developed by...

A Concept of Maximum Stream Depletion Rate for Leaky Aquifers in Alluvial Valleys